On periodically-cyclic Gale 4-polytopes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Construction for Periodically-Cyclic Gale 2m-Polytopes

For each v, k and m such that v ≥ k ≥ 2m + 2 ≥ 8, we construct a periodically-cyclic Gale 2m-polytope with v vertices and the period k. For such a polytope, there is a complete description of each of its facets based upon a labelling (total ordering) of the vertices so that every subset of k successive vertices generates a cyclic 2m-polytope. MSC 2000: 52B11, 52B05

متن کامل

On Gale and braxial polytopes

Cyclic polytopes are characterized as simplicial polytopes satisfying Gale’s evenness condition (a combinatorial condition on facets relative to a fixed ordering of the vertices). Periodically-cyclic polytopes are polytopes for which certain subpolytopes are cyclic. Bisztriczky discovered a class of periodically-cyclic polytopes that also satisfy Gale’s evenness condition. The faces of these po...

متن کامل

The Random Edge Simplex Algorithm on Dual Cyclic 4-polytopes

The simplex algorithm using the random edge pivot-rule on any realization of a dual cyclic 4-polytope with n facets does not take more than O(n) pivot-steps. This even holds for general abstract objective functions (AOF) / acyclic unique sink orientations (AUSO). The methods can be used to show analogous results for products of two polygons. In contrast, we show that the random facet pivot-rule...

متن کامل

On Perfect 4-Polytopes

The concept of perfection of a polytope was introduced by S. A. Robertson. Intuitively speaking, a polytope P is perfect if and only if it cannot be deformed to a polytope of different shape without changing the action of its symmetry group G(P ) on its face-lattice F (P ). By Rostami’s conjecture, the perfect 4-polytopes form a particular set of Wythoffian polytopes. In the present paper first...

متن کامل

Subpolytopes of Cyclic Polytopes

A remarkable result of I. Shemer [4] states that the combinatorial structure of a neighbourly 2m-polytope determines the combinatorial structure of each of its subpolytopes. From this, it follows that every subpolytope of a cyclic 2m-polytope is cyclic. In this note, we present a direct proof of this consequence that also yields that certain subpolytopes of a cyclic (2m+ 1)-polytope are cyclic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2001

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(01)00112-1